(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces
نویسندگان
چکیده
In this paper, we construct a fully homomorphic encryption (FHE) scheme over integers with the message space ZQ for any prime Q. Even for the binary case Q = 2, our decryption circuit has a smaller degree than that of the previous scheme; the multiplicative degree is reduced from O(λ(log λ)) to O(λ), where λ is the security parameter. We also extend our FHE scheme to a batch FHE scheme.
منابع مشابه
Faster Bootstrapping of FHE over the Integers
Bootstrapping in fully homomorphic encryption (FHE) over the integers is a homomorphic evaluation of the squashed decryption function suggested by van Dijk et al. The typical approach for the bootstrapping is representing the decryption function as a binary circuit with a fixed message space. All bootstrapping methods in FHEs over the integers use this approach; however, these methods require t...
متن کاملBatch Fully Homomorphic Encryption over the Integers
We extend the fully homomorphic encryption scheme over the integers of van Dijk et al. (DGHV) into a batch fully homomorphic encryption scheme, i.e. to a scheme that supports encrypting and homomorphically processing a vector of plaintexts as a single ciphertext. We present two variants in which the semantic security is based on different assumptions. The first variant is based on a new decisio...
متن کاملFully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext ...
متن کاملA Depth Specific Description of Somewhat Homomorphic Encryption and Its Applications
In this paper, we consider the depth-specific description of somewhat homomorphic encryption(SHE) schemes over integers. The ciphertexts of SHE scheme may have various forms depending on its encryption depth, and this makes the correctness check of the encryption scheme cumbersome. However, if one can present a SHE scheme depth-specifically, the correctness check is enough with depth-wise check...
متن کاملNew Fully Homomorphic Encryption over the Integers
We first present a fully homomorphic encryption scheme over the integers, which modifies the fully homomorphic encryption scheme in [vDGHV10]. The security of our scheme is merely based on the hardness of finding an approximate-GCD problem over the integers, which is given a list of integers perturbed by the small error noises, removing the assumption of the sparse subset sum problem in the ori...
متن کامل